Minimization of 2-level AND/XOR Expressions using Ordered Kronecker Functional Decision Diagrams
نویسندگان
چکیده
We present two new classes of 2-level AND/XOR expressions: the class RKRO of Reduced Kronecker Expressions and the class GKRO of Generalized Kronecker Expressions. GKRO contains RKRO and KRO, the well-known class of Kronecker Expressions Sas93b] as a subclass. There is a close relation between RKROs, KROs, GKROs and Ordered Kro-necker Functional Decision Diagrams (OKFDDs) DST + 94], that together with eecient OKFDD algorithms can be utilized for (exact and heuristical) minimization of RKROs, KROs and GKROs. In this paper we concentrate on RKROs and KROs and propose several algorithms for their minimization. Experimental results are given to show the eeciency of our approach. For the rst time eecient minimized 2-level AND/XOR expressions are determined for benchmark functions with more than 100 variables. Furthermore, we compare our solutions to results obtainable for other classes of AND/XOR forms. In particular, RKROs are much smaller than FPRMs and also turn out to be superior to KROs. In many cases they are even as compact as GKROs.
منابع مشابه
Frankfurt am Main , March 1995 Dynamic Minimization of OKFDDs
We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Our approach is based on dynamic variable ordering and decomposition type choice. For changing the decomposition type we use a new more eecient method. The quali...
متن کاملDynamic minimization of OKFDDs
We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Our approach is based on dynamic variable ordering and decomposition type choice. For changing the decomposition type we use a new method. We brieey discuss the ...
متن کاملMinimization of Ordered Pseudo Kronecker Decision Diagrams
The introduction of Decision Diagrams (DDs) has brought new means towards solving many of the problems involved in digital circuit design. Compactness of the representation is one key issue. Ordered Pseudo Kronecker Decision Diagrams (OPKDDs) together with the use of complemented edges is known to offer the most general ordered, read-once DD representation at the bit-level, hence OPKDDs hold al...
متن کاملAn Artificial Immune Algorithm to Minimize Ordered Kronecker Functional Decision Diagrams using in FPGAs
In this study, we introduce the use of one Artificial Immune System (AIS) algorithm called Clonal Selection Algorithm (CSA) in order to minimize the size of an Ordered Kronecker Functional Decision Diagram (OKFDD) which represents a Boolean function as a graph. The size of such a graph is a critical factor by reason of OKFDDs are used to derive circuits by substituting the each nodes with AND/X...
متن کاملMinimization of OKFDDs by Genetic Algorithms
A Genetic Algorithm (GA) is applied to minimize the size of Ordered Kronecker Functional Decision Diagrams (OKFDDs). Our approach chooses a good variable ordering and decomposition type list in parallel. We apply our minimization algorithm to technology mapping for FPGAs. Experimental results are given to show the eeciency of our approach.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007